منابع مشابه
Lower Bounds for Measurable Chromatic Numbers
The Lovász theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program. In this paper we generalize it so that it gives a lower bound for the measurable chromatic number of distance graphs on compact metric spaces. In particular we consider distance graphs on the unit sphere. There we transform the original infinite semidefinit...
متن کاملFactorization law for two lower bounds of concurrence
Entanglement, one of the important features of quantum systems, which does not exist classically, has been known as a key resource for some quantum computation and information processes. But the entanglement of a system changes due to its unavoidable interactions with environment. To study the entanglement changes, one needs to make use of an entanglement measure in order to specify the entangl...
متن کاملLower Bounds of Concurrence for Tripartite Quantum Systems
Xiu-Hong Gao, Shao-Ming Fei, and Ke Wu a Department of Mathematics, Capital Normal University, Beijing 100037, China b Max Planck Institute for Mathematics in the Sciences, D-04103 Leipzig, Germany Abstract We derive an analytical lower bound for the concurrence of tripartite quantum mixed states. A functional relation is established relating concurrence and the generalized partial transpositions.
متن کاملBounds on the Measurable Chromatic Number
Let H be a set of positive real numbers. We define the geometric graph GH as follows: its vertex set is R” or S”, and two vertices are adjacent if the distance between them belongs to H. If H = { 1) we write Gi. A set A of vertices is H-independent if A is independent in GH. The problem we consider is: how big can an H-independent set be? That is, how big can a set be if certain distances are f...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2011
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic11.1-2-6